On the chromatic index of almost all graphs
نویسندگان
چکیده
منابع مشابه
On the chromatic index of almost all graphs
Vizing has shown that if G is a simple graph with maximum vertex-degree p, then the chromatic index of G is either p or p + 1 . In this note we prove that almost all graphs have a unique vertex of maximum degree, and we deduce that almost all graphs have chromatic index equal to their maximum degree . This settles a conjecture of the second author (in "Proceedings of the Fifth British Combinato...
متن کاملOn Almost Bipartite Large Chromatic Graphs
In the past we have published quite a few papers on chromatic numbers of graphs (finite or infinite), we give a list of those which are relevant to our present subject in the references . In this paper we will mainly deal with problems of the following type : Assuming that the chromatic number x(1) of a graph is greater than K, a finite or infinite cardinal, what can be said about the behaviour...
متن کاملThe Strong Chromatic Index of Random Graphs
The strong chromatic index of a graph G, denoted by χs(G), is the minimum number of colors needed to color its edges so that each color class is an induced matching. In this paper we analyze the asymptotic behavior of this parameter in a random graph G(n, p), for two regions of the edge probability p = p(n). For the dense case, where p is a constant, 0 < p < 1, we prove that with high probabili...
متن کاملThe Distance-t Chromatic Index of Graphs
We consider two graph colouring problems in which edges at distance at most t are given distinct colours, for some fixed positive integer t. We obtain two upper bounds for the distance-t chromatic index, the least number of colours necessary for such a colouring. One is a bound of (2− ε)∆t for graphs of maximum degree at most ∆, where ε is some absolute positive constant independent of t. The o...
متن کاملThe Strong Chromatic Index of Graphs
The strong chromatic index of graphs Mohammad Mahdian Master of Science Graduate Department of C o m p t e r Science University of Toronto 2000 A strong edge-colouring of a graph G is an assignrnent of colours to the edges of G such that every colour class is an induced matching. The minimum number of colours in such a colouring is called the strong chromatic index of G. In 1985, Erdos and Nese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1977
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90039-9